منابع مشابه
Hamiltonian Decomposition of the Hypercube
We consider the problem of Hamiltonian decomposition on the hypercube. It is known that there exist bn=2c edge-disjoint Hamiltonian cycles on a binary n-cube. However, there are still no simple algorithms to construct such cycles. We present some promising results that may lead to a very simple method to obtain the Hamiltonian decomposition. The binary n-cube is equivalent to the Cartesian prod...
متن کاملBalanced Parallel Sort on Hypercube Multiprocessors
A parallel sorting algorithm for sorting n elements evenly distributed over Z d = p nodes of a d-dimensional hypercube is presented. The average running time of the algorithm is O( ( n log n)/p + p log2 n). The algorithm maintains a perfect load balance in the nodes by determining the (kn/p)th elements (k = 1,. . . , ( p 1)) of the final sorted list in advance. These p 1 keys are used to partit...
متن کاملDecomposition of Balanced Matrices
A 0; 1 matrix is balanced if it does not contain a square submatrix of odd order with two ones per row and per column. We show that a balanced 0,1 matrix is either totally unimodular or its bipartite representation has a cutset consisting of two adjacent nodes and some of their neighbors. This result yields a polytime recognition algorithm for balancedness. To prove the result, we rst prove a d...
متن کاملExistence of a maximum balanced matching in the hypercube
We prove, that for n 6= 2 the maximum possible b2n/2nc edges can be chosen simultaneously from each parallel class of the n-cube in such a way, that no two edges have a common vertex.
متن کاملOn the balanced decomposition number
A balanced coloring of a graph G means a triple {P1, P2,X} of mutually disjoint subsets of the vertex-set V (G) such that V (G) = P1⊎P2⊎X and |P1| = |P2|. A balanced decomposition associated with the balanced coloring V (G) = P1⊎P2⊎X of G is defined as a partition of V (G) = V1⊎· · ·⊎Vr (for some r) such that, for every i ∈ {1, · · · , r}, the subgraphG[Vi] of G is connected and |Vi∩P1| = |Vi∩P...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DEStech Transactions on Computer Science and Engineering
سال: 2017
ISSN: 2475-8841
DOI: 10.12783/dtcse/aiea2017/14931